Asymptotic Worst-Case Analyses for the Open Bin Packing Problem
نویسنده
چکیده
ii
منابع مشابه
The Ordered Open-End Bin-Packing Problem
We study a variant of the classical bin-packing problem, the ordered open-end bin-packing problem, where first a bin can be filled to a level above 1 as long as the removal of the last piece brings the bin’s level back to below 1 and second, the last piece is the largest-indexed piece among all pieces in the bin. We conduct both worst-case and average-case analyses for the problem. In the worst...
متن کاملComputing the asymptotic worst-case of bin packing lower bounds
This paper addresses the issue of computing the asymptotic worst-case of lower bounds for the Bin Packing Problem. We introduce a general result that allows to bound the asymptotic worst-case performance of any lower bound for the problem and to derive for the first time the asymptotic worst-case of the well-known bound L3 by Martello and Toth. We also show that the general result allows to eas...
متن کاملOn the Asymptotic Worst Case Behavior of Harmonic Fit
In the parametric bin packing problem we must pack a list of items with size smaller than or equal to 1rr in a minimal number of unit-capacity bins. Among the Ž . approximation algorithms, the class of Harmonic Fit algorithms HF plays an M Ž Ž . . important role. Lee and Lee J. Assoc. Comput. Mach. 32 1985 , 562]572 and Ž Ž . . Galambos Ann. Unï . Sci. Budapest Sect. Comput. 9 1988 , 121]126 pr...
متن کاملStrip Packing vs. Bin Packing
In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithms to strip packing. More precisely we obtain the following results: (1) Any offline bin packing algorithm can be applied to strip packing maintaining the same asymptotic worst-case ratio. Thus using FFD (MFFD) as a su...
متن کاملAn asymptotic approximation scheme for the concave cost bin packing problem
We consider a generalized one-dimensional bin packing model in which the cost of a bin is a nondecreasing concave function of the utilization of the bin. We show that for any given positive constant , there exists a polynomial-time approximation algorithmwith an asymptotic worst-case performance ratio of no more than 1 + .
متن کامل